Complexity of Indefinite Elliptic Problems By Arthur
نویسنده
چکیده
This paper deals with the approximate solution of a linear regularly-elliptic 2mth-order boundary-value problem Lu = f, with / 6 Hr(Q) for r > —m. Suppose that the problem is indefinite, i.e., the variational form of the problem involves a weaklycoercive bilinear form. Of particular interest is the quality of the finite element method (FEM) of degree k using n inner products of /. The error of the approximation is measured in the Sobolev /-norm (0 < / < m); we assume that k > 2m 1 I. We assume that an a priori bound is known for either the Sobolev r-norm or for the Sobolev r-seminorm of /. We first consider the normed case. We find that the FEM has minimal error if and only if fc > 2m-1+r. Regardless of the values of k and r, there exists a linear combination (called the spline algorithm) of the inner products used by the FEM which does have minimal error. For the seminormed case, we give a very restrictive condition which is necessary and sufficient for the error of the FEM to have a bound which is independent of /. When this condition holds, we find that the FEM has minimal error if and only if fc > 2m — 1 + r. However, we once again find that the spline algorithm (using the same inner products as does the FEM) has minimal error, no matter what values fc and r have and regardless of whether the FEM has uniformly bounded error. We also show that the inner products used by the FEM is the best set of linear functional to use.
منابع مشابه
The Complexity of Indefinite Elliptic Problems with Noisy Data
We study the complexity of second-order indeenite elliptic problems ?div(aru) + bu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , the error being measured in the H 1 (()-norm. The problem elements f belong to the unit ball of W r;p ((), where p 2 2; 1] and r > d=p. Information consists of (possibly-adaptive) noisy evaluations of f , a, or b (or their derivati...
متن کاملWhat is the Complexity of Related Elliptic , Parabolic , and Hyperbolic Problems ? By Arthur
TVaub and Wozniakowski have dealt with the complexity of some simple partial differential equations. They chose three model problems and showed that the parabolic problem considered had significantly lower complexity than the elliptic problem, which in turn had significantly lower complexity than the hyperbolic problem considered. They asked whether this is true in general. We show that this is...
متن کاملAn optimal adaptive wavelet method for nonsymmetric and indefinite elliptic problems∗
In this paper, we modify the adaptive wavelet algorithm from [Technical Report 1325, Department of Mathematics, Utrecht University, March 2005] so that it applies directly, i.e., without forming the normal equation, not only to self-adjoint elliptic operators but also to such operators to which generally nonsymmetric lower order terms are added, assuming that the resulting operator equation is ...
متن کاملWhat is the Complexity of Related
TVaub and Wozniakowski have dealt with the complexity of some simple partial differential equations. They chose three model problems and showed that the parabolic problem considered had significantly lower complexity than the elliptic problem, which in turn had significantly lower complexity than the hyperbolic problem considered. They asked whether this is true in general. We show that this is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010